Perbaikan Min-Max Distribusi Dengan Multiple Criteria ABC Analysis NG-Model Untuk Pengoptimalan List Part Number
نویسندگان
چکیده
منابع مشابه
Rough-Set Multiple-Criteria ABC Analysis
Multiple-criteria ABC (MCABC) analysis is conducted using a dominance-based rough set approach. ABC analysis, a well-known technique for inventory planning and control, divides stock-keeping units (SKUs) into three classes according to annual dollar usage. But MCABC analysis offers more managerial flexibility by including other criteria, such as lead time and criticality, in the classification ...
متن کاملMulti-Criteria TSP: Min and Max Combined
We present randomized approximation algorithms for multicriteria traveling salesman problems (TSP), where some objective functions should be minimized while others should be maximized. For the symmetric multi-criteria TSP (STSP), we present an algorithm that computes (2/3−ε, 4+ε) approximate Pareto curves. Here, the first parameter is the approximation ratio for the objectives that should be ma...
متن کاملAnalysis of FPGA based Designs using Min-max Number
Cost of an FPGA implementation is given by propagation time and number of logic cells required. Before implementation, a rough idea of cost of design is necessary in order to take design decisions related to target technology to be selected, FPGA implementation, decomposition strategies, etc. This paper attempts to perform a complete mathematical analysis of general functions to be implemented ...
متن کاملThe Online House Numbering Problem: Min-Max Online List Labeling
We introduce and study the online house numbering problem, where houses are added arbitrarily along a road and must be assigned labels to maintain their ordering along the road. The online house numbering problem is related to classic online list labeling problems, except that the optimization goal here is to minimize the maximum number of times that any house is relabeled. We provide several a...
متن کاملRunning max/min calculation using a pruned ordered list
{ We present a novel algorithm for calculating the running maximum or minimum value of a one-dimensional sequence over a sliding data window. The new algorithm stores a pruned ordered list of data elements that have the potential to become maxima or minima across the data window at some future time instant. This algorithm has a number of advantages over competing algorithms, including balanced ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Ilmiah Teknik Industri
سال: 2019
ISSN: 2460-4038,1412-6869
DOI: 10.23917/jiti.v18i1.7727